Channel estimation and equalization for hard-limited signals

ABSTRACT

The present invention provides a method and apparatus for channel estimation when the amplitude of a received signal is hard-limited. A channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal and previous channel estimates. The amplitude estimates may comprise the expected values of the amplitude given the phase samples and the initial channel estimates. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples. The process may be performed iteratively to refine the channel estimates during each iteration.

TECHNICAL FIELD

The present invention relates generally to a method and apparatus for equalizing a received signal transmitted over a wireless communication link and, more particularly, to a method and apparatus for generating channel estimates from the phase information for a received signal in a receiver with a hard-limiting front end.

BACKGROUND

Many high-performance wireless receivers in cellular communication systems have a linear receiver front-end that is capable of providing both amplitude and phase information for the received signal to the baseband signal processing unit. For this kind of receiver, an automatic gain control (AGC) unit is often needed to bring the fading signal into the linear operating range of the receiver. The requirement of AGC increases not only the design effort, but also the overall cost and power consumption of the receiver.

Hard (amplitude) limiting receivers are known to be small in size, low in cost, and energy efficient. For such receivers, no AGC is required since the dynamic range of the signal amplitude is limited in the front-end. Consequently, hardware cost, and power consumption can be significantly reduced compared to the linear receivers. Hard-limiting receiver front ends are particularly suitable for applications of wireless technology, such as distributed sensor networks, Bluetooth, and Ultra-Wideband (UWB) systems, where lightweight, low cost, and low power consumption are extremely important for the wireless nodes. However, because hard-limiting receivers can provide only reliable phase information for the received signal to the baseband signal processor, hard-limiting receivers are often significantly outperformed by linear receivers. One of the main factors for their inferior performance is the lack of an accurate channel estimate, which is difficult to derive from only the phase information in the received signal.

SUMMARY

The present invention relates to a method and apparatus for generating accurate channel estimates from the phase samples of a received signal where the received signal has been hard-limited. According to one exemplary embodiment, a channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal and previous channel estimates. The amplitude estimates may comprise the expected values of the amplitude given the phase samples and the previous channel estimates. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples.

One exemplary embodiment comprises a method and apparatus for computing the amplitude estimates iteratively from the phase samples of the received signal. During each iteration, a channel estimator computes amplitude estimates from the received phase samples and previous channel estimates. The amplitude estimates are then combined with the phase samples to reconstruct an estimate of the received signal, which is used to compute revised estimates of the channel. The iterative process is repeated until a predetermined stop criterion is met and the channel estimate derived in the final iteration is output.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary receiver according to one embodiment of the present invention.

FIG. 2 illustrates an exemplary method for computing channel estimates according to a first embodiment.

FIG. 3 illustrates an exemplary channel estimation processor for generating channel estimates according to the first embodiment.

FIG. 4 illustrates an exemplary method for computing channel estimates according to a second embodiment.

FIG. 5 illustrates an exemplary channel estimation processor for generating channel estimates according to the second embodiment.

DETAILED DESCRIPTION

Referring now to the drawings, FIG. 1 illustrates an exemplary wireless receiver 10 according to one embodiment of the invention. Wireless receiver 10 comprises a receiver front-end 12 and a baseband processor 14. Receiver front-end 12 amplifies, filters, downconverts, and digitizes received signals that contain transmitted information and the baseband processor 14 processes the digitized baseband signals to extract the transmitted information. In a preferred embodiment, the receiver front-end 12 comprises a hard-limiting front end that limits the amplitude of the received signal. Because the amplitude of the received signal is hard-limited, there is no need for automatic gain control (AGC) circuits in the receiver front end 12 to adjust the dynamic range of the receiver front end 12. The baseband processor 14 includes an equalizer 16 for equalizing the received signal and a channel processor 18 to generate channel estimates for the equalizer 16. Equalizer 16 may comprise, for example, a conventional maximum likelihood sequence estimation (MLSE) equalizer, as described by Sirikiat Ariyavisitakul, “Equalization of a hard-limited slowly-fading multipath signal using a phase equalizer with time-reversal structure,” IEEE Journal on Selected Areas in Communications, vol. 10, pp. 589-598, April 1992. The MLSE equalizer 16 uses channel estimates provided by the channel processor 18 to generate an estimate of the transmitted symbols. The channel processor 18 generates estimates of the channel response from a known training sequence contained within the received signal. Because amplitude information is not available, the channel processor 18 must produce accurate channel estimates based on only on the phase information in the received signal. The baseband processor 14 may include other elements not relevant to the claimed invention, such as a decoder 20 following the equalizer to decode the transmitted symbols.

The received signal r(n) with no hard-limiting (i.e., both phase and amplitude components are available) may be modeled as:

$\begin{matrix} \begin{matrix} {{r(n)} = {{a_{r}(n)}^{j\; {\varphi_{r}{(n)}}}}} \\ {= {{\sum\limits_{k = 0}^{L - 1}{{c(k)}{s\left( {n - k} \right)}}} + {w(n)}}} \\ {{= {{{s(n)}^{T}c} + {w(n)}}},} \end{matrix} & (1) \end{matrix}$

where a_(r)(n) and φ_(r)(n) denote respectively the amplitude and phase of the signal r(n), {s(n)} denotes the pilot sequence or training sequence, {c(k)}_(k=0) ^(L−1) denotes the time-domain channel response of length L, and {w(n)} denotes the additive noise modeled as white complex Gaussian process with variance E|w(n)|²=σ². For notational simplicity, let c=(c(0),c(1), . . . , c(L−1))^(T) and s(n)=(s(n),s(n−1), . . . , s(n−L+1))^(T).

With a hard-limiting front-end 12, the only available part of the received signal is a series of phase samples {φ_(r)(n)}, from which the equalizer 14 must detect the transmitted sequence {s(n)}. The marginal log likelihood function given the transmitted symbols s(n), the channel c, and the noise variance σ² is given by:

$\begin{matrix} \begin{matrix} {{{ll}_{\varphi_{r}{(n)}}\left( {{s(n)},c,\sigma} \right)} \equiv {\log \; {p\left( {\left. {\varphi_{r}(n)} \middle| {s(n)} \right.,c,\sigma} \right)}}} \\ {{= \left. {\log {\int_{0}^{\infty}{a_{r}{p\left( {\left. {r(n)} \middle| {s(n)} \right.,c,\sigma} \right)}}}} \middle| {}_{{r{(n)}} = {a_{r}e^{{j\varphi}_{r}{(n)}}}}{a_{r}} \right.},} \end{matrix} & (2) \\ {where} & \; \\ {{p\left( {\left. {r(n)} \middle| {s(n)} \right.,c,\sigma} \right)} = {\frac{1}{\pi \; \sigma^{2}}\exp \left\{ {- \frac{{{{r(n)} - {{s(n)}^{T}c}}}^{2}}{\sigma^{2}}} \right\}}} & (3) \end{matrix}$

represents the marginal probability density function of r(n) given s(n), c(n), and σ².

After some manipulations, it may be shown that:

$\begin{matrix} {{{{ll}_{\varphi_{r}{(n)}}\left( {{s(n)},c,\sigma} \right)} = {{- {\gamma \left( {{s(n)},c,\sigma} \right)}^{2}} + {\log \left( {1 + {\sqrt{\pi}{\alpha \left( {{\varphi_{r}(n)},{s(n)},c,\sigma} \right)}^{{\alpha {({{\varphi_{r}{(n)}},{s{(n)}},c,\sigma})}}^{2}}{{erfc}\left( {- {\alpha \left( {{\varphi_{r}(n)},{s(n)},c,\sigma} \right)}} \right)}}} \right)} - {\log \left( {2\; \pi} \right)}}},\mspace{20mu} {where}} & (4) \\ {\mspace{79mu} {{{{erfc}(x)} \equiv {\frac{2}{\sqrt{\pi}}{\int_{x}^{x}{^{- y^{2}}\ {y}}}}},\mspace{20mu} {and}}} & (5) \\ {\mspace{79mu} {{{{\gamma \left( {{s(n)},c,\sigma} \right)} \equiv \frac{{^{{- j}\; {\varphi_{r}{(n)}}}{s(n)}^{T}c}}{\sigma}} = \frac{{{s(n)}^{T}c}}{\sigma}},\mspace{20mu} {and}}} & (6) \\ \begin{matrix} {\mspace{79mu} {{\alpha \left( {{\varphi_{r}(n)},{s(n)},c,\sigma} \right)} \equiv \frac{{Re}\left\{ {^{{- j}\; {\varphi_{r}{(n)}}}{s(n)}^{T}c} \right\}}{\sigma}}} \\ {{= {{\gamma \left( {{s(n)},c,\sigma} \right)}{\cos \left( {{\varphi_{r}(n)} - {\varphi_{s^{T_{c}}}(n)}} \right)}}},} \end{matrix} & (7) \end{matrix}$

and φ_(s) _(T) _(c)(n) denotes the phase of s(n)^(T)c. Note that the marginal log likelihood function depends on the phase φ_(r)(n) only through α, and depends on the channel c and the noise variance σ only through α and γ.

Because the noise {w(n)} is assumed to be white, the received phase samples {φ_(r)(n)} are conditionally independent given the transmitted symbols {s(n)} and the channel c. Therefore, the log likelihood function given the entire sequence {s(n)}, the channel c and the noise variance σ² is the sum of the marginal log likelihoods. Dropping the constant term, the desired branch metric for an MLSE phase equalizer 16 is obtained as:

dM _(Phase)(n,s(n))=−γ(s(n),c,σ)²+log(1+√{square root over (π)}α(φ_(r)(n), s(n), c, σ)e ^(α(φ) ^(r) ^((n),s(n),cσ)) ² erfc(−α(φ_(r)(n),s(n),c, σ)))   (8)

To compute this branch metric, estimates of the channel response c and the noise variance σ²are needed. To obtain the maximum-likelihood (ML) estimate of c and σ, the derivative of Eq. (4) may be set to zero and solved for c and σ. Unfortunately, there is no close form expression for the ML estimates of c and σ, which makes this approach impractical.

According to the present invention, an iterative Expectation-Maximization(EM) method is used to compute a ML estimate of the channel response based only on the phase information in the received signal r(n). The EM method provides an intuitive method of estimating a desired parameter from incomplete observed data by iteratively estimating the missing data. In the present invention, the missing data is the amplitude information for the received signal r(n). The EM method is used to iteratively estimate the amplitude (the missing data) of the received signal r(n) based on the phase samples of the received signal and previous channel estimates. The amplitude estimates are then used to compute revised channel estimates in each iteration using conventional channel estimation techniques. Revised channel estimates are computed in each iteration by combining the computed amplitude estimates with the phase samples of the received signal to reconstruct an estimate {circumflex over (r)}(n) of the received signal. The received signal estimate is then used to compute revised channel estimates using conventional channel estimation techniques. The revised channel estimate may be used as the previous channel estimate for the next iteration.

According to one embodiment of the present invention, the EM method is used to compute the joint estimate (ĉ_(ML), {circumflex over (σ)}_(ML)) of c and σ that maximizes the log-likelihood function:

$\begin{matrix} {{\left( {{\hat{c}}_{ML},{\hat{\sigma}}_{ML}} \right) = {\underset{({c,\sigma})}{\arg \; \max}{\sum\limits_{n = {L - 1}}^{N - 1}{{ll}_{\varphi_{r}{(n)}}\left( {{s_{t}(n)},c,\sigma} \right)}}}},} & (9) \end{matrix}$

where ll_(φ) _(r) _((n))(s_(l)(n),c,σ) denotes the marginal log-likelihood function given by Eq. (2). Eq. (9) is difficult to solve analytically. However, by treating the signal amplitudes {a_(r)(n)}_(n=L−1) ^(N−1) as missing observations and applying the EM method, it is possible to iteratively compute a series of joint estimates {(ĉ^(n), {circumflex over (σ)}^(n))} that converge to (ĉ_(ML), {circumflex over (σ)}_(ML)). During the n^(th) iteration, the joint estimate (ĉ^(n), {circumflex over (σ)}^(n)) is computed according to:

$\begin{matrix} {{\left( {{\hat{c}}^{({n - 1})},{\hat{\sigma}}^{({n + 1})}} \right) = {\underset{({c,\sigma})}{\arg \; \max}\mspace{14mu} {E\left\lbrack {\left. {\log \; {p\left( {a_{r},\left. \varphi_{r} \middle| c \right.,\sigma} \right)}} \middle| \varphi_{r} \right.,{\hat{c}}^{(n)},{\hat{\sigma}}^{(n)}} \right\rbrack}}},} & (10) \\ {where} & \; \\ \begin{matrix} {{p\left( {a_{r},\left. \varphi_{r} \middle| c \right.,\sigma} \right)} = {\prod\limits_{n = {L - 1}}^{N - 1}\; {p\left( {{a_{r}(n)},\left. {\varphi_{r}(n)} \middle| c \right.,\sigma} \right)}}} \\ {{= {\frac{\prod\limits_{n = {L - 1}}^{N - 1}{a_{r}(n)}}{\left( {\pi \; \sigma} \right)^{N - L + 1}}\exp \left\{ {- \frac{{{{\Phi_{r}a_{r}} - {Sc}}}^{2}}{\sigma^{2}}} \right\}}},} \end{matrix} & (11) \\ {and} & \; \\ {{\Phi_{r} \equiv \begin{pmatrix} ^{j\; {\varphi_{r}{({L - 1})}}} & 0 & \ldots & 0 \\ 0 & ^{j\; {\varphi_{r}{(L)}}} & 0 & \vdots \\ \vdots & 0 & ⋰ & 0 \\ 0 & \ldots & 0 & ^{j\; {\varphi_{r}{({N - 1})}}} \end{pmatrix}},} & (12) \end{matrix}$

and S=(s_(t)(L−1),s_(t)(L), . . . , s_(t)(N−1))^(T) denotes the convolution matrix of the training sequence.

The solution to Eq. (10) may be obtained by estimating the signal amplitude â^((n+1)) over the training sequence based on the phase samples {φ_(r)} of the received signal and then computing revised channel estimates ĉ^((n+1)) and revised noise statistics ({circumflex over (σ)}^((n+1)))².

During each iteration, the amplitude â^((n+1)) is estimated by computing the expected value (or conditional mean) of the amplitude given the phase φ_(r) of the received signal, previous channel estimate ĉ^((n)), and previous noise statistics {circumflex over (σ)}^((n)) according to:

$\begin{matrix} {{{\hat{a}}_{r}^{({n + 1})} = {{E\left\lbrack {\left. a_{r} \middle| \varphi_{r} \right.,{\hat{c}}^{(n)},{\hat{\sigma}}^{(n)}} \right\rbrack} = {{\hat{\sigma}}^{(n)}{f\left( \frac{m^{(n)}}{{\hat{\sigma}}^{(n)}} \right)}}}},{{{where}\mspace{14mu} m^{(n)}} \equiv {{Re}\left\{ {\Phi_{r}^{H}S\; {\hat{c}}^{(n)}} \right\} \mspace{14mu} {and}}}} & (13) \\ {{f(x)} = {x + {\frac{1}{2\left( {x + \frac{1}{\sqrt{\pi}^{x^{2}}{{erfc}\left( {- x} \right)}}} \right)}.}}} & (14) \end{matrix}$

The previous channel estimate ĉ^((n)) is the channel estimate generated in a previous iteration. For the first iteration, ĉ^((n)) is initialized to some starting value, which may be chosen arbitrarily, or may be based on other available information. With the amplitude estimates â_(r) ^((n+1)), revised channel estimates ĉ^((n+1)) may than be computed using any known channel estimation technique. For example, least square channel estimates may be computed according to:

$\begin{matrix} {{\hat{c}}^{({n + 1})} = {\left( {S^{H}S} \right)^{- 1}S^{H}{\underset{{\hat{r}}^{({n + 1})}}{\underset{}{\left\lbrack {\Phi_{r}{\hat{a}}^{({n + 1})}} \right\rbrack}}.}}} & (15) \end{matrix}$

Alternatively, the channel processor 18 may generate Maximum A Posteriori (MAP) channel estimates according to:

ĉ ^((n+1))=(S ^(H) S+({circumflex over (σ)}^((n)))² I)⁻¹ S ^(H) [Φ _(r) â ^((n+1))].   (16)

It may be noted that the product Φ_(r)â^((n+1))={circumflex over (r)}^(n+1) in Eqs. 15 and 16 is an estimate of the received signal reconstructed by combining the amplitude estimates with the phase samples of the received signal.

After computing revised channel estimates ĉ^((n+1)), the channel processor 18 may compute revised noise statistics {circumflex over (σ)}^((n+1)) according to:

$\begin{matrix} {\begin{matrix} {{\hat{\sigma}}^{({n + 1})} = \sqrt{\frac{1}{N - L + 1}{E\left\lbrack {\left. {{r - {S\; {\hat{c}}^{({n + 1})}}}}^{2} \middle| \varphi_{r} \right.,{\hat{c}}^{(n)},{\hat{\sigma}}^{(n)}} \right\rbrack}}} \\ {= \sqrt{{\frac{1}{N - L + 1}\left\lbrack {ɛ^{({n + 1})} + {\left( {\hat{\sigma}}^{(n)} \right)^{2}{{h\left( \frac{m^{(n)}}{{\hat{\sigma}}^{(n)}} \right)}}^{2}}} \right\rbrack},}} \end{matrix}{where}} & (17) \\ {{{h(x)} \equiv \sqrt{\begin{matrix} {\frac{1}{2} + \frac{1}{2\left( {1 + {\sqrt{\pi}x\; ^{x^{2}}{{erfc}\left( {- x} \right)}}} \right)} -} \\ \left\lbrack \frac{1}{2\left( {x + \frac{1}{\sqrt{\pi}^{x^{2}}{{erfc}\left( {- x} \right)}}} \right)} \right\rbrack^{2} \end{matrix}}}{and}} & (18) \\ \begin{matrix} {ɛ^{({n + 1})} = {{{\hat{r}}^{({n + 1})} - {\Phi_{r}{\hat{a}}^{({n + 1})}}}}^{2}} \\ {= {{{{\Phi_{r}{\hat{a}}^{({n + 1})}} - {S\; {\hat{c}}^{({n + 1})}}}}^{2}.}} \end{matrix} & (19) \end{matrix}$

In the illustrated embodiments, the noise statistic comprises the noise standard deviation. However other noise statistics, for example the noise variance, may also be used.

FIG. 2 illustrates an exemplary method 100 implemented by the channel processor 18 for computing channel estimates ĉ according to one embodiment of the present invention. The receiver front end 12 provides the received phase samples {φ_(r)} of the received signal over the training sequence to the channel processor 18. The channel processor 18 initializes the channel estimates ĉ and noise statistics {circumflex over (σ)} (block 102). The initial channel estimates and noise statistics are denoted respectively by ĉ⁽⁰⁾ and {circumflex over (σ)}⁽⁰⁾. The initial estimates may be set arbitrarily (e.g., ĉ⁽⁰⁾=[1,1] for L=2 and σ=0.1). Also, other information may be used if available. For example, the channel estimates and noise statistics from a previous period may be used as the initial estimates. In OFDM systems, channel estimates and noise statistics from a different subcarrier may be used if available to initialize the channel estimates for a selected subcarrier.

Following initialization of the channel estimates ĉ and noise statistics {circumflex over (σ)}, the channel processor 18 iteratively computes the channel estimates ĉ and noise statistics {circumflex over (σ)} based on the phase samples {φ_(r)} of the received signal (blocks 104-108). During each iteration, the channel processor 18 computes amplitude estimates â for the received signal based on the phase samples {φ_(r)} and previous channel estimates ĉ^((n)) according to Eq. 13 (block 104). The initial channel estimates ĉ⁽⁰⁾ serve as the previous channel estimates ĉ^((n)) in the first iteration. By combining the estimated signal amplitudes â with the phase samples {φ_(r)}, the channel processor 18 is able, in effect, to reconstruct an estimate {circumflex over (r)}(n) of the received signal before hard-limiting. The received signal estimate {circumflex over (r)}(n) is then used in a conventional manner to generate revised channel estimates ĉ (block 106). For example, least square channel estimates ĉ_(LSE) may be computed according to Eq. (15), or MAP channel estimates ĉ_(MAP) may be computed according to Eq. 16.

Once the revised channel estimates ĉ are obtained, the channel processor 18 computes a revised noise statistic {circumflex over (σ)} by computing the mean square error according to Eq. (19) and the noise standard deviation according to Eq. (17) (block 108). After computing the revised noise statistic {circumflex over (σ)}, the channel processor 18 determines whether to continue with another iteration based on some predetermined stop criteria (block 110). For example, the channel processor 18 may stop after a predetermined maximum number of iterations are reached. Alternatively, the channel processor 18 may stop when the incremental change in the sum of marginal log-likelihood functions is less than a predetermined threshold. If the stop criterion is met, the channel processor 18 outputs the most recent channel estimate generated during the last iteration and stops (block 114). If the stop criteria is not met, the channel processor 18 increments the index n (block 112) and repeats blocks 104-110.

FIG. 3 illustrates an exemplary channel processor 18 for generating channel estimates ĉ according to the method shown in FIG. 2. The channel processor 18 comprises an amplitude estimator 22, a channel estimator 24, a noise statistic estimator 26, and a controller 28. The amplitude estimator 22 generates amplitude estimates â over the length of the training sequence based on the phase samples {φ_(r)} of the received signal r(n). The amplitude estimator 22 provides the amplitude estimates â to channel estimator 24, which combines the amplitude estimates â with the phase samples {φ_(r)} to reconstruct an estimate of the received signal {circumflex over (r)}(n) and generate revised channel estimates ĉ. The noise statistic estimator 26 computes the noise statistic (e.g., the noise standard deviation) based on the channel estimates ĉ provided by the channel estimator 24, amplitude estimates â from the amplitude estimator 22, and the estimate {circumflex over (r)}(n) of the received signal. Controller 28 determines when to stop the iterative process based on the number of iterations performed, or on some predetermined convergence criterion.

The channel estimation method described above may be simplified by setting the noise standard deviation estimate {circumflex over (σ)}^((n))=1 at each iteration. The effect of this simplification yields normalized amplitude and channel estimates denoted respectively by â_(NORMAL) and ĉ_(NORMAL). FIG. 4 illustrates an exemplary method 200 implemented by the channel processor 18 for computing normalized channel estimates ĉ_(NORMAL) according to a second embodiment of the present invention. As in the first embodiment, the receiver front end 12 provides the phase φ_(r) of the received signal over the training sequence to the channel processor 18. The channel processor 18 initializes the normalized channel estimate ĉ_(NORMAL) ⁽⁰⁾ (block 202). The initial normalized channel estimate ĉ_(NORMAL) ⁽⁰⁾ may be set arbitrarily as previously described, or another available channel estimate may be used as the initial normalized channel estimate ĉ_(NORMAL) ⁽⁰⁾. Following initialization of the normalized channel estimates ĉ_(NORMAL), the channel processor 18 iteratively computes the normalized channel estimates ĉ_(NORMAL) based on the phase samples {φ_(r)} of the received signal (blocks 204-206). During each iteration, channel processor 18 estimates the normalized amplitudes â_(NORMAL) of the received signal over the training sequence based on the phase samples {φ_(r)} and the previous normalized channel estimates ĉ_(NORMAL) ^((n)) according to Eq. 13 (block 204). The initial normalized channel estimates ĉ_(NORMAL) ⁽⁰⁾ serve as the previous normalized channel estimates ĉ_(NORMAL) ^((n)) for the first iteration. By combining the estimated signal amplitudes â_(NORMAL) with the phase samples {φ_(r)} of the received samples, the channel processor 18 is able to reconstruct an estimate {circumflex over (r)}(n) of the received signal. The received signal estimate {circumflex over (r)}(n) is then used in a conventional manner to generate revised normalized channel estimates ĉ_(NORMAL) (block 206). For example, least square channel estimates may be computed according to Eq. (13) or Eq. (17). Once the updated channel estimate ĉ_(NORMAL) is obtained, the channel processor 18 determines whether to continue with another iteration based on some predetermined stop criterion as previously described (block 208). For example, the channel processor 18 may stop after a predetermined maximum number of iterations are reached. Alternatively, the channel processor 18 may stop when the incremental change in the sum of marginal log-likelihood functions is less than a predetermined threshold. If the stop criterion is met, the channel processor 18 outputs the most recent channel estimate generated during the last iteration and stops (block 212). If the stop criteria is not met, the channel estimator increments the index n (block 210) and repeats blocks 204-208.

FIG. 5 illustrates an exemplary channel processor 18 for generating channel normalized estimates according to the second embodiment shown in FIG. 4. In this embodiment, the noise estimator is not required. The channel processor 18 comprises an amplitude estimator 22, a channel estimator 24, and a controller 28. The amplitude estimator 22 generates normalized amplitude estimates â_(NORMAL) over the length of the training sequence based on the phase of the received signal. The amplitude estimator 22 provides the normalized amplitude estimates â_(NORMAL) to the channel estimator 24, which combines the normalized amplitude estimates â_(NORMAL) with the received phase samples {φ_(r)} to reconstruct an estimate {circumflex over (r)}(n) of the received signal and generate revised normalized channel estimates ĉ_(NORMAL). The controller 28 determines when to stop the iterative process based on the number of iterations performed, or on some predetermined convergence criterion.

The present invention allows the receiver 10 to compute an accurate estimate of the channel response using only the phase information of the received signal. The ability to generate accurate channel estimates from only the phase of the received signal enables the receiver 10 to have a hard-limiting front-end which is typically smaller in size, lower in cost, and more energy efficient than a linear front-end. The channel estimation processor 18 is compatible with any training sequence including those designed for receivers that provide both amplitude and phase of the received signal to the baseband processor 14. Hence, the transmitter does not have to alter the transmission format depending upon whether the receiver 10 has a hard-limiting or a linear front-end.

The present invention may, of course, be carried out in other ways than those specifically set forth herein without departing from essential characteristics of the invention. The present embodiments are to be considered in all respects as illustrative and not restrictive, and all changes coming within the meaning and equivalency range of the appended claims are intended to be embraced therein. 

1. A method of generating channel estimates for a received signal that is hard-limited based on phase samples of the received signal, said method comprising: computing expected amplitude values for the received signal based on the phase samples and previous channel estimates; and computing revised channel estimates based on the expected amplitude values and the phase samples.
 2. The method of claim 1 wherein the computation of the expected amplitude values for the received signal is based further on a previous noise statistic.
 3. The method of claim 1 wherein the expected amplitude values for the received signal and the revised channel estimates are computed iteratively.
 4. The method of claim 3 wherein the revised channel estimates computed during each iteration are available as the previous channel estimates for a subsequent iteration.
 5. The method of claim 4 wherein the computation of the expected amplitude values for the received signal is based further on a previous noise statistic.
 6. The method of claim 5 further comprising computing a revised noise statistic during each iteration, wherein the revised noise statistic computed during each iteration is available as the previous noise statistic for a subsequent iteration.
 7. The method of claim 6 wherein computing a revised noise statistic during each iteration comprises computing an expected noise statistic based on the revised channel estimate and a known symbol sequence.
 8. The method of claim 1 wherein the revised channel estimates comprise least squares channel estimates.
 9. The method of claim 1 wherein the revised channel estimates comprise maximum a postieri (MAP) channel estimates. 10 The method of claim 1 wherein said expected amplitude values and said channel estimates comprise normalized values.
 11. A channel estimation processor for generating channel estimates based on the phase of a received signal that is hard-limited, said channel estimation processor comprising: an amplitude estimator to generate amplitude estimates for the received signal by computing expected values for the amplitude of the received signal based on received phase samples of the received signal and previous channel estimates; and a channel estimator to compute revised channel estimates based on the amplitude estimates and the phase samples.
 12. The channel estimation processor of claim 11 wherein the amplitude estimator is configured to compute the expected values for the amplitude of the received signal based further on a previous noise standard deviation estimate.
 13. The channel estimation processor of claim 11 wherein the amplitude estimator is configured to compute iteratively the expected values for the amplitudes of the received signal and the revised channel estimates.
 14. The channel estimation processor of claim 13 wherein the amplitude estimator is configured to use revised channel estimates computed during a prior iteration as the previous channel estimates for a current iteration.
 15. The channel estimation processor of claim 13 wherein the amplitude estimator is further configured to compute the expected values for the amplitudes of the received signal based further on a previous noise statistic.
 16. The channel estimation processor of claim 15 further comprising a noise estimator to compute a revised noise statistic during each iteration, wherein the revised noise statistic computed during each iteration is available as the previous noise statistic for a subsequent iteration.
 17. The channel estimation processor of claim 16 wherein the noise estimator is configured to compute the revised noise statistic by computing an expected noise statistic based on the revised channel estimate and a known symbol sequence.
 18. The channel estimation processor of claim 11 wherein the channel estimator is configured to compute revised channel estimates as least squares channel estimates.
 19. The channel estimation processor of claim 11 wherein the channel estimator is configured to compute revised channel estimates as maximum a postieri (MAP) channel estimates.
 20. The channel estimation processor of claim 11 wherein said amplitude estimates comprise normalized amplitude estimates, and wherein said revised channel estimates comprise normalized channel estimates.
 21. A method of generating channel estimates for equalizing a received signal that is hard-limited, said method comprising: iteratively computing amplitude estimates for a received signal, wherein the amplitude estimates are computed during each iteration based on phase samples of the received signal and previous channel estimates; computing revised channel estimates during each iteration based on the phase samples of the received signal and the computed amplitude estimates; and outputting the channel estimates derived in a final iteration when a predetermined stop criterion is met.
 22. The method of claim 21 wherein computing amplitudes estimates for the received signal comprises computing expected values of the amplitude of the received signal.
 23. The method of claim 21 wherein the revised channel estimates computed during each iteration are available as the previous channel estimates for a subsequent iteration.
 24. The method of claim 21 wherein the computation of the amplitude estimates for the received signal is based further on a previous noise statistic.
 25. The method of claim 24 further comprising computing a revised noise statistic during each iteration, wherein the revised noise statistic computed during each iteration is available as the previous noise statistic for a subsequent iteration.
 26. The method of claim 25 wherein computing the revised noise statistic during each iteration comprises computing an expected noise statistic based on the revised channel estimate and a known symbol sequence.
 27. The method of claim 21 wherein the revised channel estimates comprise least squares channel estimates.
 28. The method of claim 21 wherein the revised channel estimates comprise maximum a postieri (MAP) channel estimates.
 29. The method of claim 11 wherein said amplitude estimates comprise normalized amplitude estimates, and wherein said revised channel estimates comprise normalized channel estimates. 